Restricted Constrained Delaunay Triangulations
نویسندگان
چکیده
We introduce the restricted constrained Delaunay triangulation (restricted CDT). The restricted CDT generalizes the restricted Delaunay triangulation, allowing us to define a triangulation of a surface that includes a set of constraining segments. Under certain sampling conditions, the restricted CDT includes every constrained segment and suggests an algorithm that produces a triangulation of the surface that contains every constraining segment.
منابع مشابه
Towards a Definition of Higher Order Constrained Delaunay Triangulations
When a triangulation of a set of points and edges is required, the constrained Delaunay triangulation is often the preferred choice because of its well-shaped triangles. However, in applications like terrain modeling, it is sometimes necessary to have flexibility to optimize some other aspect of the triangulation, while still having nicely-shaped triangles and including a set of constraints. Hi...
متن کاملConstrained Delaunay Triangulations and Algorithms
Two-dimensional constrained Delaunay triangulations (of a planar straight-linegraph) introduced independently by Lee et al. [2] and Chew [1] are well studied struc-tures and can be constructed in optimal time. However, the generalization of suchobjects to three and higher dimensions is much less discussed in literature.In this talk, we first define a constrained Delaunay tri...
متن کاملGeneral-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of user-specified domains, they have “nicely shaped” triangles that optimize several criteria, and they are easy to construct and update. The present work generalizes constrained Delaunay triangulations (CDTs) to higher dimensions, a...
متن کاملFun with Restricted Delaunay Triangulations
The restricted Delaunay triangulation is a subcomplex of the three-dimensional Delaunay triangulation that serves as a triangulation of a smooth surface embedded in three-dimensional space. It has proven itself as a mathematically powerful tool for surface meshing and surface reconstruction. I discuss two fascinating mathematical twists on these structures. First, I address a question of Bruno ...
متن کاملThree-Dimensional Constrained Delaunay Triangulation: a Minimalist Approach
In this paper we summarize our experiences with 3D constrained Delaunay triangulation algorithms for industrial applications. In addition, we report a robust implementation process for constructing 3D constrained triangulations from initial unconstrained triangulations, based on a minimalist approach, in which we minimize the use of geometrical operations such as intersections. This is achieved...
متن کامل